Space-bounded complexity classes and iterated deterministic substitution
نویسندگان
چکیده
منابع مشابه
Relationships Between Quantum and Classical Space-Bounded Complexity Classes
This paper investigates the relative power of space-bounded quantum and classical (probabilistic) computational models. The following relationships are proved. 1. Any probabilistic Turing machine (PTM) which runs in space s and which halts absolutely (i.e. halts with certainty after a nite number of steps) can be simulated in space O(s) by a quantum Turing machine (QTM). If the PTM operates wit...
متن کاملNotes for Lecture 7 1 Space - Bounded Complexity Classes
A machine solves a problem using space s(·) if, for every input x, the machine outputs the correct answer and uses only the first s(|x|) cells of the tape. For a standard Turing machine, we can’t do better than linear space since x itself must be on the tape. So we will often consider a machine with multiple tapes: a read-only “input” tape, a read/write “work” or “memory” tape, and possibly a w...
متن کاملSpace-Bounded Quantum Complexity
This paper investigates the computational power of space-bounded quantum Turing machines. The following facts are proved for space-constructible space bounds s satisfying s(n) = Ω(log n). 1. Any quantum Turing machine (QTM) running in space s can be simulated by an unbounded error probabilistic Turing machine (PTM) running in space O(s). No assumptions on the probability of error or running tim...
متن کاملDeterministic Amplification of Space-Bounded Probabilistic Algorithms
This paper initiates the study of deterministic amplification of space-bounded probabilistic algorithms. The straightforward implementations of known amplification methods cannot be used for such algorithms, since they consume too much space. We present a new implementation of the Ajtai-Komlós-Szemerédi method, that enables to amplify an S-space algorithm that uses r random bits and errs with p...
متن کاملNotes on Space - Bounded Complexity
A machine solves a problem using space s(·) if, for every input x, the machine outputs the correct answer and uses only the first s(|x|) cells of the tape. For a standard Turing machine, we can’t do better than linear space since x itself must be on the tape. So we will often consider a machine with multiple tapes: a read-only “input” tape, a read/write “work” or “memory” tape, and possibly a w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1980
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(80)90172-2